Algorithms for Dynamic Negotiation

Most connict situations are dynamic processes where negotiation is carried out and the payoo not only depends on the nal state but on the entire process leading to that nal state. In this paper, we present three techniques by generalizing the concepts of connict and solution method so as to include dynamic features into the negotiation methodology. The three techniques are: a graph concept in a dynamic framework, a utility gain model and a negotiation algorithm. In an upper Rio Grande basin case study, we use the negotiation algorithms to resolve connicts in water resources management, especially water allocation where sources of connicts appear to involve: 1. satisfaction of water demand, 2. preservation of water quality, and 3. the non-quantiication of Native American rights. Results of the case study are analyzed and interpreted showing how negotiations can lead to satisfactory solutions. INTRODUCTION In this paper, we provide three appproaches for connict resolution, namely a graph concept in a dynamic framework, a utility gained model, and a negotiation algorithm. We are mainly concerned with connict resolution and negotiation considered as evolutionary processes involving dynamic changes. Connict resolution and negotiation are virtually inevitable whenever humans interact,